A Fast, Compact Approximation of the Exponential Function

نویسنده

  • Nicol N. Schraudolph
چکیده

Neural network simulations often spend a large proportion of their time computing exponential functions. Since the exponentiation routines of typical math libraries are rather slow, their replacement with a fast approximation can greatly reduce the overall computation time. This article describes how exponentiation can be approximated by manipulating the components of a standard (IEEE-754) floating-point representation. This models the exponential function as well as a lookup table with linear interpolation, but is significantly faster and more compact.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving high-order partial differential equations in unbounded domains by means of double exponential second kind Chebyshev approximation

In this paper, a collocation method for solving high-order linear partial differential equations (PDEs) with variable coefficients under more general form of conditions is presented. This method is based on the approximation of the truncated double exponential second kind Chebyshev (ESC) series. The definition of the partial derivative is presented and derived as new operational matrices of der...

متن کامل

Comparison of Exact Analysis and Steplines Approximation for Externally Excited Exponential Transmission Line

In the present paper, the problem of externally excited exponential transmission line hasbeen solved analytically in frequency domain using a simple approach. Then steplines approximationas a first order approximation for the problem of externally excited nonuniform transmission lines ingeneral and exponentially tapered transmission line (ETL) as a special case has been presented.Finally the tw...

متن کامل

$L^p$-Conjecture on Hypergroups

In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions  for a weighted Lebesgue space  $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$.  Among the other things, we also show that if $K$ is a locally compact hyper...

متن کامل

Universal Approximation of Interval-valued Fuzzy Systems Based on Interval-valued Implications

It is firstly proved that the multi-input-single-output (MISO) fuzzy systems based on interval-valued $R$- and $S$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy.  A formula to compute the lower upper bounds on the number  of interval-valued fuzzy sets needed to achieve a pre-specified approximation  accuracy for an arbitrary multivariate con...

متن کامل

Approximating Bayes Estimates by Means of the Tierney Kadane, Importance Sampling and Metropolis-Hastings within Gibbs Methods in the Poisson-Exponential Distribution: A Comparative Study

Here, we work on the problem of point estimation of the parameters of the Poisson-exponential distribution through the Bayesian and maximum likelihood methods based on complete samples. The point Bayes estimates under the symmetric squared error loss (SEL) function are approximated using three methods, namely the Tierney Kadane approximation method, the importance sampling method and the Metrop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neural computation

دوره 11 4  شماره 

صفحات  -

تاریخ انتشار 1999